-
1 алгоритм Моргана для генерации всех неизоморфных ациклических структур
Универсальный русско-английский словарь > алгоритм Моргана для генерации всех неизоморфных ациклических структур
-
2 алгоритм Моргана
Makarov: Morgan algorithm
См. также в других словарях:
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
David Morgan-Mar — Occupation Optical engineer Website http://www.dangermouse.net/ David Morgan Mar (aka DangerMouse) is a Ph.D. graduat … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Package-merge algorithm — The Package Merge Algorithm is an O(nL) time algorithm for finding anoptimal length limited Huffman code for a given distribution on a given alphabet of size n , where no code word is longer than L . It is a greedy algorithm, and a generalization … Wikipedia
Hybrid algorithm (constraint satisfaction) — In constraint satisfaction, a hybrid algorithm solves a constraint satisfaction problem by the combination of two different methods, for example variable conditioning (backtracking, backjumping, etc.) and constraint inference (arc consistency,… … Wikipedia
Xiaolin Wu's line algorithm — is an algorithm for line antialiasing, which was presented in the article An Efficient Antialiasing Technique in the July 1991 issue of Computer Graphics , as well as in the article Fast Antialiasing in the June 1992 issue of Dr. Dobb s Journal… … Wikipedia
Generic cell rate algorithm — The generic cell rate algorithm (or GCRA) is an algorithm which measures cell rate at a specified timescale [#REF| [1] . The GCRA is an implementation of the leaky bucket algorithm in ATM networks, and provides a traffic shaping function [#REF|… … Wikipedia
Nagle's algorithm — Nagle s algorithm, named after John Nagle, is a means of improving the efficiency of TCP/IP networks by reducing the number of packets that need to be sent over the network. Nagle s document, Congestion Control in IP/TCP Internetworks (RFC 896)… … Wikipedia
Distributed algorithm — A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used in many varied application areas of distributed computing, such as telecommunications,… … Wikipedia
Booth's multiplication algorithm — is a multiplication algorithm that multiplies two signed binary numbers in two s complement notation.ProcedureBooth s algorithm involves repeatedly adding one of two predetermined values A and S to a product P , then performing a rightward… … Wikipedia
C4.5 algorithm — C4.5 is an algorithm used to generate a decision tree developed by Ross Quinlan. C4.5 is an extension of Quinlan s earlier ID3 algorithm. The decision trees generated by C4.5 can be used for classification, and for this reason, C4.5 is often… … Wikipedia